Hosoya polynomials under gated amalgamations
نویسندگان
چکیده
منابع مشابه
Hosoya polynomials under gated amalgamations
An induced subgraph H of a graph G is gated if for every vertex x outside H there exists a vertex x ′ inside H such that each vertex y of H is connected with x by a shortest path passing through x . The gated amalgam of graphs G1 and G2 is obtained from G1 and G2 by identifying their isomorphic gated subgraphs H1 and H2. Two theorems on Hosoya polynomials of gated amalgams are provided. As thei...
متن کاملWiener Index under Gated Amalgamations
Abstract. A subgraph H of a graph G is gated if for every x ∈ V (G) there exists a vertex u in H such that dG(x, v) = dG(x, u) + dG(u, v) for any v ∈ V (H). The gated amalgam of graphs G1 and G2 is obtained from G1 and G2 by identifying their isomorphic gated subgraphs H1 and H2. Two theorems on the Wiener index of gated amalgams are proved. Several known results on the Wiener index of (chemica...
متن کاملHosoya polynomials of random benzenoid chains
Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagon...
متن کاملComputing Hosoya Polynomials of Graphs from Primary Subgraphs
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyperWiener index. An expression is obtained that reduces the computation of the Hosoya polynomials of a graph with cut vertices to the Hosoya polynomial of the so-called primary subgraphs. The main theorem is applied to specific constructions including bouq...
متن کاملGenus distributions of graphs under edge-amalgamations
We present a general method for calculating the genus distributions of those infinite families of graphs that are obtained by iteratively amalgamating copies of some base graphs along their root-edges. We presume that the partitioned genus distributions of these base graphs are known and that their root-edges have 2-valent endpoints. We analyze and adapt the use of recombinant strands, partials...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.09.030